Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Approximation, randomization, and combinatorial optimization (algorithms and techniques)")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 188

  • Page / 8
Export

Selection :

  • and

Approximation, randomization, and combinatorial optimization (algorithms and techniques)Arora, Sanjeev; Jansen, Klaus; Rolim, José D.P et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40770-7, IX, 408 p, isbn 3-540-40770-7Conference Proceedings

Approximation, randomization, and combinatorial optimization (algorithms and techniques)Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-38044-2, 1Vol, XII-522 p, isbn 3-540-38044-2Conference Proceedings

Approximation, randomization, and combinatorial optimization (algorithms and techniques)Jansen, Klaus; Khanna, Sanjeev; Rolim, José D.P et al.Lecture notes in computer science. 2004, issn 0302-9743, isbn 3-540-22894-2, IX, 428 p, isbn 3-540-22894-2Conference Proceedings

Testing the independence number of hypergraphsLANGBERG, Michael.Lecture notes in computer science. 2004, pp 405-416, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper

Perfectly balanced allocationCZUMAJ, Artur; RILEY, Chris; SCHEIDELER, Christian et al.Lecture notes in computer science. 2003, pp 240-251, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper

Simultaneous Source LocationANDREEV, Konstantin; GARROD, Charles; MAGGS, Bruce et al.Lecture notes in computer science. 2004, pp 13-26, issn 0302-9743, isbn 3-540-22894-2, 14 p.Conference Paper

Distribution-free connectivity testingHALEVY, Shirley; KUSHILEVITZ, Eyal.Lecture notes in computer science. 2004, pp 393-404, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper

Convergence issues in competitive gamesMIRROKNI, Vahab S; VETTA, Adrian.Lecture notes in computer science. 2004, pp 183-194, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper

Covering graphs using trees and starsEVEN, G; GARG, N; KÖNEMANN, J et al.Lecture notes in computer science. 2003, pp 24-35, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper

Min-max multiway cutSVITKINA, Zoya; TARDOS, Eva.Lecture notes in computer science. 2004, pp 207-218, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper

Edge coloring with delaysALON, Noga; ASODI, Vera.Lecture notes in computer science. 2004, pp 237-248, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper

Approximate testing of visual propertiesRASKHODNIKOVA, Sofya.Lecture notes in computer science. 2003, pp 370-381, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper

Correlation clustering with partial informationDEMAINE, Erik D; IMMORLICA, Nicole.Lecture notes in computer science. 2003, pp 1-13, issn 0302-9743, isbn 3-540-40770-7, 13 p.Conference Paper

Computational analogues of entropyBARAK, Boaz; SHALTIEL, Ronen; WIGDERSON, Avi et al.Lecture notes in computer science. 2003, pp 200-215, issn 0302-9743, isbn 3-540-40770-7, 16 p.Conference Paper

Distribution-free property testingHALEVY, Shirley; KUSHILEVITZ, Eyal.Lecture notes in computer science. 2003, pp 302-317, issn 0302-9743, isbn 3-540-40770-7, 16 p.Conference Paper

Asymmetry in k-center variantsINGE LI GØRTZ; WIRTH, Anthony.Lecture notes in computer science. 2003, pp 59-70, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper

Approximating market equilibriaJAIN, Kamal; MAHDIAN, Mohammad; SABERI, Amin et al.Lecture notes in computer science. 2003, pp 98-108, issn 0302-9743, isbn 3-540-40770-7, 11 p.Conference Paper

The sketching complexity of pattern matchingBAR-YOSSEF, Ziv; JAYRAM, T. S; KRAUTHGAMER, Robert et al.Lecture notes in computer science. 2004, pp 261-272, issn 0302-9743, isbn 3-540-22894-2, 12 p.Conference Paper

The Lovász number of random graphsCOJA-OGHLAN, Amin.Lecture notes in computer science. 2003, pp 228-239, issn 0302-9743, isbn 3-540-40770-7, 12 p.Conference Paper

On the hardness of approximate multivariate integrationKOUTIS, Ioannis.Lecture notes in computer science. 2003, pp 122-128, issn 0302-9743, isbn 3-540-40770-7, 7 p.Conference Paper

On the crossing spanning tree problemBILO, Vittorio; GOYAL, Vineet; RAVI, R et al.Lecture notes in computer science. 2004, pp 51-60, issn 0302-9743, isbn 3-540-22894-2, 10 p.Conference Paper

On bounded distance decoding for general latticesLIU, Yi-Kai; LYUBASHEVSKY, Vadim; MICCIANCIO, Daniele et al.Lecture notes in computer science. 2006, pp 450-461, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper

Randomness-efficient sampling within NCHEALY, Alexander.Lecture notes in computer science. 2006, pp 398-409, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper

Single-source stochastic routingCHAWLA, Shuchi; ROUGHGARDEN, Tim.Lecture notes in computer science. 2006, pp 82-94, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 13 p.Conference Paper

On the error parameter of dispersersGRADWOHL, Ronen; KINDLER, Guy; REINGOLD, Omer et al.Lecture notes in computer science. 2005, pp 294-305, issn 0302-9743, isbn 3-540-28239-4, 12 p.Conference Paper

  • Page / 8